Toric codes and finite geometries

We show how the theory of affine geometries over the ring Z/〈q−1〉 can be used to understand the properties of toric and generalized toric codes over Fq. The minimum distance of these codes is strongly tied to the collections of lines in the finite geometry that contain subsets of the exponent vectors of the monomials that are evaluated to produce the standard generator matrix for the code. We argue that this connection is, in fact, even more direct than the connection with the lattice geometry of those exponent vectors considered as elements of Z or R. This point of view should be useful both as a way to visualize properties of these codes and as a guide to heuristic searches for good codes constructed in this fashion. In particular, we will use these ideas to see a reason why these constructions have been so successful over the field F8, but less successful in other cases.